# squaring circuit

squaring circuit
схема формирования [формирователь] прямоугольных импульсов

English-Russian dictionary of computer science and programming. 2013.

### Смотреть что такое "squaring circuit" в других словарях:

• Squaring the square — is the problem of tiling an integral square using only other integral squares. (An integral square is a square whose sides have integer length.) The name was coined in a humorous analogy with squaring the circle. Squaring the square is an easy… …   Wikipedia

• Translinear circuit — A translinear circuit is a circuit that carries out its function using the translinear principle. These are current mode circuits that can be made using transistors that obey an exponential current voltage characteristic this includes BJTs and… …   Wikipedia

• Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia

• number game — Introduction       any of various puzzles and games that involve aspects of mathematics.       Mathematical recreations comprise puzzles and games that vary from naive amusements to sophisticated problems, some of which have never been solved.… …   Universalium

• Joint Tribal Council of the Passamaquoddy Tribe v. Morton — Court United States Court of Appeals for the First Circuit Full case name Joint Tribal Council of the Passamaquoddy Tribe v. Rogers C. B. Morton, Secretary, Department of the Interior, et al …   Wikipedia

• Sound from ultrasound — Contents 1 Parametric array 2 Applications 2.1 Commercial advertising …   Wikipedia

• Phasor (sine waves) — In physics and engineering, a phase vector ( phasor ) is a representation of a sine wave whose amplitude (A), phase (θ), and frequency (ω) are time invariant. It is a subset of a more general concept called analytic representation. Phasors reduce …   Wikipedia

• Polynomial hierarchy — In computational complexity theory, the polynomial hierarchy is a hierarchy of complexity classes that generalize the classes P, NP and co NP to oracle machines.DefinitionsThere are multiple equivalent definitions of the classes of the polynomial …   Wikipedia

• Problème NP-complet — En théorie de la complexité, un problème NP complet est un problème de décision vérifiant les propriétés suivantes : Il est possible de vérifier une solution efficacement (en temps polynomial) ; la classe des problèmes vérifiant cette… …   Wikipédia en Français